Method, Apparatus And Computer Program For Scheduling The Extraction Of A Resource And For Determining The Net Present Value Of An Extraction Schedule

ABSTRACT

The scheduling of extraction of a resource within a mine is disclosed which comprises obtaining drill hole grade data relating to the resource and creating a plurality of different block models, with each block in each model having a resource grade and each of the block models honouring the drill hole grade data. An extraction schedule is determined based on a cut-off grade policy to increase expected net present value of the mine. The cut-off grade policy can be a variable cut-off grade and the scheduling using the variable cut-off grade is converted from a non-linear representation to a linear representation and a mixed integer programming formulation is used for simultaneous optimisation of the extraction schedule and the cut-off grade.

This application is a continuation of U.S. application Ser. No.11/610,617 filed Dec. 14, 2006, and claims priority to PCT ApplicationPCT/AU2005/000761 published in English on Dec. 29, 2005 as WO2005/124104 and to Australian Application Nos. 2004903360 filed Jun. 21,2004, 2005901100 filed Mar. 8, 2005, the entire contents of each areincorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to a method and apparatus for schedulingthe extraction of a resource and for determining the net present valueof an extraction schedule. Typically the resource is an ore body whichis to be mined in an open cut mine.

BACKGROUND OF THE INVENTION

Typically, the mining of a resource may take place over a period of15-30 years before the mine is exhausted to a position where furthermining is not economic.

The process of mine development and design and long-term scheduling isbased on spatial interpretation of drillhole data. Thus, drillholes aredrilled over the region to be mined and data relating to the grade ofthe resource is obtained. The drillholes are generally drilled areasonable distance apart because this procedure is relativelyexpensive. A block model of the region to be mined is created andtypically, the block model may contain between 50,000 to 1,000,000blocks which are to be scheduled for mining over the period of 15-30years. A block is that material enclosed by a rectangular prism in theground and may contain air to a volumetric percentage strictly less than100%. A block model is a collection of non-intersecting blocks that areusually, but not necessarily, spatially connected and which contain noless than all material considered to have economic value in a miningenterprise. The objective of the scheduling procedure is to find theblock extraction sequence which produces the maximum possible netpresent value (NPV) and obeys a number of constraints. The constraintsinclude:

(a) geotechnical slope constraints which are modelled by a set ofprecedence rules constraining the order of extraction of individualblocks;

(b) mining constraints, i.e. total maximum amount of rock which can bemined in one time period (usually 1 year);

(c) processing constraints, i.e. maximum amount or ore which can beprocessed through a given processing plant in one time period;

(d) and the market constraints, i.e. the maximum amount of metal, whichcan be sold in one time period.

Any other constraints salient to the practical mining operationincluding but not restricted to maximum limits in sinking-rate andavailable ore.

A schedule is a period of extraction for each block and a destinationfor each block (waste, stockpile or process plant.

The ore body model which is built up from the drillhole data is adeterministic model created by spatial interpretation of the data usingsome kind of so-called Kriging procedure. This enables each of theblocks in the model to be assigned a resource grade (i.e. the amount ofthe resource present in the block). The resource grade information isthen used to determine the scheduling of the mining operation, and alsowhether a particular block is sent for processing to extract theresource, sent to waste, or stockpiled for later processing.

Because the drillholes are generally drilled some distance apart, thedrillhole data is usually sparse and therefore this introduces inherenterrors in the deterministic block model. To some extent, this can beovercome by providing more data by drilling more holes. However, as isexplained above, the drilling of the drillholes is expensive andtherefore, this is not desirable.

Thus, traditionally open pit mine planning is based on the block modelwhich is built up using some kind of interpolation technique such as theKriging procedure so that a single model is produced. This single modelis assumed to be a fair representation of reality and is used for minedesign and optimisation. The design process consists of three mainsteps:

(a) finding the block extraction sequence which produces the best netpresent value whilst satisfying geotechnical slope constraints;

(b) designing the practically mineable mine phases (so-called pushbacks) which are roughly based on the optimal block sequence; and

(c) optimising the mining schedule and cut-off grades.

The cut-off grade (COG) is defined as the threshold such that the blockswith a grade above it are sent to the processing plant and with a gradebelow it are treated as waste. It can be constant for the whole life ofmine, or can be variable, i.e. dependent on the period of extraction.

In practice, the open mine is divided into a number of the miningphases, which are mined bench by bench, each bench being represented bya horizontal layer of blocks within the given mining phase and havingthe same elevation. A bench within a mining phase is sometimes referredto as a “panel” (one or more layers of blocks). The mining phases can bemined one by one from top to bottom. However, this kind of schedule isusually sub-optimal. Mining several phases simultaneously and applying avariable cut-off grade can produce much better results. There areseveral commercially available packages which claim to optimise theschedule and cut-off grade using a single block model representation ofthe resource. However, it is difficult to estimate their effectivenessas the upper theoretical limit on the net present value remains unknown.

The standard optimisation technique widely used in many industrialapplications is the linear and integer programming (e.g. Padberg, 2003).However, in order for this program to operate satisfactorily, theproblem to be solved needs to be formulated as a linear one.

SUMMARY OF THE INVENTION

A first aspect of the invention is concerned with scheduling theextraction of a resource to improve the net present value.

The invention may therefore be said to reside in a method of schedulingthe extraction of a resource within a medium comprising the steps of:

obtaining drillhole grade data relating to the resource contained withinthe medium;

creating a plurality of different block models, each formed of aplurality of blocks, each block in each model having a resource grade,each of the block models honouring the drillhole grade data; and

scheduling extraction of blocks based on a cut-off grade policy toincrease expected net present value having regard to all of the blockmodels.

Thus, by using a plurality of different block models, a much largernumber of possible representations of the presence of the resource inthe medium are obtained. Each of those representations is equally likelyto occur because each honours the drillhole grade data which have beenmeasured. Thus, by using all of those possibilities, a more accuraterepresentation of the actual resource distribution within the medium canbe obtained, and therefore a better indication of whether a region ofthe medium represented by a block should be forwarded to processing. Forexample, if the cut-off grade of the resource in a particular period is0.6%, the method is able to see that a particular block may in somerealities be below this cutoff grade (in which case it is sent towaste), and in some realities is above this cutoff grade (in which caseit is processed). By using all of the models, such as by averagingdifferent block valuations (processed or wasted) from differentrealities we more accurately model the process in reality. This isbecause at the time of extraction extra blast-hole data are available toenable determination of a more accurate quantification of the blockgrade and hence the selectivity option encoded in the use of multipleconditional simulations can be gainfully exploited in calculating boththe schedule and undiscounted block valuation and hence ultimately inobtaining a more accurate determination of the net present value of eachblock. Thus, a schedule is obtained which gives an increased and moreaccurate net present value, compared to existing techniques, of a minecontaining the resource and the medium.

In the preferred embodiment of the invention, the creation of theplurality of different block models is a conditional simulationtechnique which provides the generation of a plurality of equallyprobable block model realisations, all of which honour the data andfirst and second order statistics of the resource represented,respectively, by probability distribution function and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction. Instances of block aggregations are assumed tohave homogeneous properties within each grade bin.

A collection of one or more blocks that are members of a particularaggregate where the grade attribute of each block falls within definedupper and lower limits is called a grade bin. Grade bins are used topractically apply cut-off grades, viz: all blocks in grade bins abovethe cut-off grade are sent to process plant.

In one embodiment of the invention, the cut-off grade is a fixed cut-offgrade. However, in the preferred embodiment of the invention, thecut-off grade is a variable cut-off grade.

In the preferred embodiment of the invention, the plurality of blockmodels are used to provide an average of resource grade and blockvaluations and the average of the resource grade and block valuations isused to produce the scheduled extraction of blocks and the cut-off gradevalue to increase expected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimized simultaneously to produce a singleextraction schedule with a variable cut-off grade policy, and whereinall the conditional simulations are valued using this schedule and thevaluations are averaged to produce the expected net present value, whichis substantially better than the one obtained by optimizing the averagegrade block model.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

In the preferred embodiment, the step of scheduling using a variablecut-off grade is converted from a non-linear representation to a linearrepresentation, and a mixed integer programming formulation is used forsimultaneous optimisation of the extraction schedule and the cut-offgrade.

Preferably the scheduling is determined by

$\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

The invention may also be said to reside in an apparatus of schedulingthe extraction of a resource within a medium from which drillhole gradedata relating to the resource contained within the medium has beenobtained comprising:

-   -   a processor for creating a plurality of different block models,        each formed of a plurality of blocks, each block in each model        having a resource grade, each of the block models honouring the        drillhole grade data; and    -   a processor for scheduling extraction of blocks based on a        cut-off grade policy to increase expected net present value        having regard to all of the block models.

In the preferred embodiment of the invention, the processor is forcreating conditional simulations which provides the generation of aplurality of equally probable block model realisations, all of whichhonour the data and first and second order statistics of the resourcerepresented, respectively, by probability distribution function andvariogram.

In one embodiment of the invention, the processor is also for reducingthe number of blocks in each of the block models by aggregating blocksprior to the step of scheduling extraction.

In one embodiment of the invention, the cut-off grade is a fixed cut-offgrade. However, in the preferred embodiment of the invention, thecut-off grade is a variable cut-off grade.

In the preferred embodiment of the invention, the processor is forproviding an average of resource grade and block valuations from theplurality of models, and the average of the resource grade and blockvaluations is used to produce the scheduled extraction of blocks and thecut-off grade value to increase expected net present value.

In one embodiment of the invention, the processor is for schedulingextraction of blocks optimised by considering the average valuationproduced from the conditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimized simultaneously to produce a singleextraction schedule with a variable cut-off grade policy, and whereinall the conditional simulations are valued using this schedule and thevaluations are averaged to produce the expected net present value, whichis substantially better than the one obtained by optimizing the averagegrade block model.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

In the preferred embodiment, the processor is for converting from anon-linear representation to a linear representation when a variablecut-off grade is used, and a mixed integer programming formulation isused for simultaneous optimisation of the extraction schedule and thecut-off grade.

Preferably the scheduling is determined by the processor by

$\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

The invention may therefore be said to reside in a computer program forscheduling the extraction of a resource within a medium comprising:

code for receiving drillhole grade data relating to the resourcecontained within the medium;

code for creating a plurality of different block models, each formed ofa plurality of blocks, each block in each model having a resource grade,each of the block models honouring the drillhole grade data; and

code for scheduling extraction of blocks based on a cut-off grade policyto increase expected net present value having regard to all of the blockmodels.

In the preferred embodiment of the invention, the code for creation ofthe plurality of different block models is code for performing aconditional simulation technique which provides the generation of aplurality of equally probable block model realisations, all of whichhonour the data and first and second order statistics of the resourcerepresented, respectively, by probability distribution function andvariogram.

In one embodiment of the invention, the program further comprises codefor reducing the number of blocks in each of the block models byaggregating blocks prior to the step of scheduling extraction.

In one embodiment of the invention, the cut-off grade is a fixed cut-offgrade. However, in the preferred embodiment of the invention, thecut-off grade is a variable cut-off grade.

In the preferred embodiment of the invention, the code for schedulingincludes code to provide an average of resource grade and blockvaluations and the average of the resource grade and block valuations isused to produce the scheduled extraction of blocks and the cut-off gradevalue to increase expected net present value.

In one embodiment of the invention, the code for scheduling furthercomprises code for optimizing extraction by considering the averagevaluation produced from the conditional simulations.

However, in the preferred embodiment of the invention, the code forscheduling further comprises code for using all of the conditionalsimulations to optimize simultaneously to produce a single extractionschedule with a variable cut-off grade policy, and wherein all theconditional simulations are valued using this schedule and thevaluations are averaged to produce the expected net present value, whichis substantially better than the one obtained by optimizing the averagegrade block model.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

In the preferred embodiment, the code for scheduling using a variablecut-off grade converts from a non-linear representation to a linearrepresentation, and further comprises a mixed integer programmingformulation is used for simultaneous optimisation of the extractionschedule and the cut-off grade.

Preferably the code for scheduling is to

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

The invention may therefore be said to reside in a method of mining amine comprising a resource within a medium, the method comprising:

-   -   removing medium and resource from the mine using an extraction        schedule created by the following steps;    -   obtaining drillhole grade data relating to the resource        contained within the medium;    -   creating a plurality of different block models, each formed of a        plurality of blocks, each block in each model having a resource        grade, each of the block models honouring the drillhole grade        data; and    -   scheduling extraction of blocks based on a cut-off grade policy        to increase expected net present value having regard to all of        the block models.

In the preferred embodiment of the invention, the creation of theplurality of different block models is a conditional simulationtechnique which provides the generation of a plurality of equallyprobable block model realisations, all of which honour the data andfirst and second order statistics of the resource represented,respectively, by probability distribution function and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction. Instances of block aggregations are assumed tohave homogeneous properties within each grade bin.

In one embodiment of the invention, the cut-off grade is a fixed cut-offgrade. However, in the preferred embodiment of the invention, thecut-off grade is a variable cut-off grade.

In the preferred embodiment of the invention, the plurality of blockmodels are used to provide an average of resource grade and blockvaluations and the average of the resource grade and block valuations isused to produce the scheduled extraction of blocks and the cut-off gradevalue to increase expected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimized simultaneously to produce a singleextraction schedule with a variable cut-off grade policy, and whereinall the conditional simulations are valued using this schedule and thevaluations are averaged to produce the expected net present value, whichis substantially better than the one obtained by optimizing the averagegrade block model.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

In the preferred embodiment, the step of scheduling using a variablecut-off grade is converted from a non-linear representation to a linearrepresentation, and a mixed integer programming formulation is used forsimultaneous optimisation of the extraction schedule and the cut-offgrade.

Preferably the scheduling is determined by

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

The invention may therefore be said to reside in a method of determiningthe net present value of a mine comprising a resource within a medium,the method comprising the steps of:

-   -   obtaining drillhole grade data relating to the resource        contained within the medium;    -   creating a plurality of different block models, each formed of a        plurality of blocks, each block in each model having a resource        grade, each of the block models honouring the drillhole grade        data; and    -   scheduling extraction of blocks based on a cut-off grade policy        to provide the net present value having regard to all of the        block models.

In the preferred embodiment of the invention, the creation of theplurality of different block models is a conditional simulationtechnique which provides the generation of a plurality of equallyprobable block model realisations, all of which honour the data andfirst and second order statistics of the resource represented,respectively, by probability distribution function and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction.

In one embodiment of the invention, the cut-off grade is a fixed cut-offgrade. However, in the preferred embodiment of the invention, thecut-off grade is a variable cut-off grade.

In the preferred embodiment of the invention, the plurality of blockmodels are used to provide an average of resource grade and blockvaluations and the average of the resource grade and block valuations isused to produce the scheduled extraction of blocks and the cut-off gradevalue to increase expected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimized simultaneously to produce a singleextraction schedule with a variable cut-off grade policy, and whereinall the conditional simulations are valued using this schedule and thevaluations are averaged to produce the expected net present value, whichis substantially better than the one obtained by optimizing the averagegrade block model.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

In the preferred embodiment, the step of scheduling using a variablecut-off grade is converted from a non-linear representation to a linearrepresentation, and a mixed integer programming formulation is used forsimultaneous optimisation of the extraction schedule and the cut-offgrade.

Preferably the scheduling is determined by

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

A further aspect of the invention concerns reducing the difficulty ofprocessing information in order to provide extraction schedules and netpresent value estimations.

According to a further aspect, the invention may be said to reside in amethod for scheduling the extraction of a resource contained within amedium, comprising the steps of:

-   -   obtaining drillhole grade data relating to the resource        contained within the medium;    -   creating a block model with each block in the model having a        resource grade;    -   scheduling extraction of blocks based on a variable cut-off        grade value to increase expected net present value, the variable        cut-off grade being represented by a non-linear function; and    -   converting the non-linear representation to a linear        representation and using a mixed integer programming formulation        for a simultaneous optimisation of an extraction sequence        provided by the scheduled extraction and cut-off grade policy.

Thus, the method according to this aspect of the invention simplifiesprocessing because of the linearisation of the problem and alsotherefore enables a variable cut-off grade to be used in theoptimisation instead of a fixed cut-off grade value.

In the preferred embodiment of the invention, the non-linear function isconverted to a plurality of linear values by producing a plurality ofstep values relating to the non-linear function, and selecting one ofthe values to provide the cut-off grade decision by the mixed integerprogramming function.

In one embodiment of the invention, the block model is a deterministicmodel built by spatial interpretation of the data using a Krigingprocedure. Thus, in this embodiment, only a single model is provided.

However, in the preferred embodiment of the invention, the block modelis a conditional simulation producing a plurality of different blockmodels providing a number of equally probably realisations of blockmodels honouring the drillhole data and first and second orderstatistics of the resource distributed in the medium represented,respectively, by probability distribution and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction.

In the preferred embodiment of the invention, the plurality of blockmodels are used to provide an average of resource grade valuations andthe average of the resource grade valuations is used to produce thescheduled extraction of blocks and the cut-off grade value to increaseexpected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimised to produce a plurality ofextraction schedules, each having valuations and the valuations areaveraged to produce the net present value, and the extraction schedulecomprises the extraction schedule which is closest to that giving thenet present value.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

Preferably the scheduling is determined by

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

According to a further aspect, the invention may be said to reside in anapparatus for scheduling the extraction of a resource contained within amedium, comprising:

-   -   a processor for receiving drillhold grade data relating to the        resource contained within the medium;    -   a processor for creating a block model with each block in the        model having a resource grade;    -   a processor for scheduling extraction of blocks based on a        variable cut-off grade value to increase expected net present        value, the variable cut-off grade being represented by a        non-linear function; and    -   a processor for converting the non-linear representation to a        linear representation and using a mixed integer programming        formulation for a simultaneous optimisation of an extraction        sequence provided by the scheduled extraction and cut-off grade        policy.

In the preferred embodiment of the invention, the processor is forconverting the non-linear function to a plurality of linear values byproducing a plurality of step values relating to the non-linearfunction, and selecting one of the values to provide the cut-off gradedecision by the mixed integer programming function.

In one embodiment of the invention, the block model is a deterministicmodel built by spatial interpretation of the data using a Krigingprocedure. Thus, in this embodiment, only a single model is provided.

However, in the preferred embodiment of the invention, the block modelis a conditional simulation producing a plurality of different blockmodels providing a number of equally probably realisations of blockmodels honouring the drillhole data and first and second orderstatistics of the resource distributed in the medium represented,respectively, by probability distribution and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction.

In the preferred embodiment of the invention, the processor is foraveraging of resource grade valuations from the block models and theaverage of the resource grade valuations is used to produce thescheduled extraction of blocks and the cut-off grade value to increaseexpected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, the processor isfor optimizing all of the conditional simulations to produce a pluralityof extraction schedules, each having valuations and the valuations areaveraged to produce the net present value, and the extraction schedulecomprises the extraction schedule which is closest to that giving thenet present value.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

Preferably the scheduling is determined by the processor by thefollowing:

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

According to a further aspect, the invention may be said to reside in acomputer program for scheduling the extraction of a resource containedwithin a medium, comprising the steps of:

-   -   code for receiving drillhole grade data relating to the resource        contained within the medium;    -   code for creating a block model with each block in the model        having a resource grade;    -   code for scheduling extraction of blocks based on a variable        cut-off grade value to increase expected net present value, the        variable cut-off grade being represented by a non-linear        function; and    -   code for converting the non-linear representation to a linear        representation and using a mixed integer programming formulation        for a simultaneous optimisation of an extraction sequence        provided by the scheduled extraction and cut-off grade policy.

In the preferred embodiment of the invention, the non-linear function isconverted to a plurality of linear values by producing a plurality ofstep values relating to the non-linear function, and selecting one ofthe values to provide the cut-off grade decision by the mixed integerprogramming function.

In one embodiment of the invention, the block model is a deterministicmodel built by spatial interpretation of the data using a Krigingprocedure. Thus, in this embodiment, only a single model is provided.

However, in the preferred embodiment of the invention, the block modelis a conditional simulation producing a plurality of different blockmodels providing a number of equally probably realisations of blockmodels honouring the drillhole data and first and second orderstatistics of the resource distributed in the medium represented,respectively, by probability distribution and variogram.

In one embodiment of the invention, the number of blocks in each of theblock models is reduced by aggregating blocks prior to the step ofscheduling extraction.

In the preferred embodiment of the invention, the plurality of blockmodels are used to provide an average of resource grade valuations andthe average of the resource grade valuations is used to produce thescheduled extraction of blocks and the cut-off grade value to increaseexpected net present value.

In one embodiment of the invention, the scheduled extraction of blocksmay be optimised by considering the average valuation produced from theconditional simulations.

However, in the preferred embodiment of the invention, all of theconditional simulations are optimised to produce a plurality ofextraction schedules, each having valuations and the valuations areaveraged to produce the net present value, and the extraction schedulecomprises the extraction schedule which is closest to that giving thenet present value.

In the preferred embodiment of the invention, the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.

Preferably the scheduling is determined by

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

wherein;

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it), is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention will be described, by way of example, withreference to the accompanying drawings in which:

FIG. 1 is a diagram showing an open cut mine in which a resource isdistributed in a medium (such as an ore body in earth and rock) in whicha block model has been overlaid;

FIG. 2 is a graph showing COG against time;

FIG. 3 is a block diagram according to one embodiment of the invention;

FIG. 4 is a graph showing the non-linear representation of variablecut-off grade;

FIG. 5 is a block diagram showing net present value estimationsaccording to embodiments of the invention;

FIGS. 6A and 6B are diagrams showing various valuations of net presentvalue;

FIG. 7 is a graph showing mining schedule optimised with a marginalcut-off grade;

FIG. 8 is a graph showing net present value of the schedule optimisationwith the marginal cut-off grade;

FIG. 9 is a graph showing a mining schedule optimised with a mean grademodel;

FIG. 10 is a graph showing net present value of the scheduledoptimisation with the mean grade model;

FIG. 11 is a graph showing mining schedule optimised with a set ofconditional simulations;

FIG. 12 is a graph showing net present value of the schedule optimisedwith the set of conditional simulations.

DETAILED DESCRIPTION OF THE EMBODIMENTS

With reference to FIG. 1 an open cut mine 10 is shown which is comprisedof a resource such as an ore body which is distributed in a medium suchas earth and rock.

The open cut mine 10 is to be mined over a significant period, such as10-30 years, and the preferred embodiment of the invention is concernedwith optimising return from the mine by scheduling mining phases tomaximum net present value of the mine 10.

The mine 10 is initially surveyed by drilling a plurality of drillholesrepresented by the lines 11 to provide data relating to the resourcecontained within the mine. The data comprises the grade of the resourceat particular locations of the drill holes 11. Typically the data willprovide a value which represents the grade of the resource as apercentage such as 0.1%, 0.6%, 1%, etc.

A block model of the mine 10 is created which is formed from a pluralityof blocks 12. Typically, the block model may contain up to half amillion blocks.

The blocks 12 provide an ore body model of blocks built up by thespatial interpolation of the data obtained from the drillholes 11.

Typically, it is desirable to mine the most valuable parts of the mineas quickly or as early as possible. Also typically, the most valuableparts of the mine are likely to be well below ground level, which meansthat a large amount of rock and earth needs to be removed before themost valuable deposits are uncovered. The preferred embodiments of theinvention therefore seek to optimise the mining schedule so that regionsof the mine represented by various ones of the blocks are removed toenable the most valuable deposits to be uncovered as quickly aspossible. The blocks which are mined prior to those blocks need to beconsidered to determine whether they are to be forwarded to waste,stockpiled for later processing, or forwarded direct to processing. Byinterpolating the grade of the ore in each of the blocks, a decision canbe made at a particular time as to whether it is desirable to forwardthe mined material for processing or whether that is uneconomical andthe material should merely be sent to waste or stockpiled for laterprocessing.

In order to determine whether a block is forwarded for processing,stockpiled or sent to waste, a cut-off grade value is established. Forexample, the cut-off grade at a particular time may be 0.6%. Thus, anyblocks which have a grade above 0.6% are sent for processing. However,if the grade is below 0.6%, a decision is made as to whether the blockis simply sent to waste or whether it is stockpiled for laterprocessing. FIG. 2 is a graph which illustrates cut-off grade withrespect to time and shows three blocks which may need to be mined atparticular times. For example, block 12 a which is mined at time T0 mayhave a grade which does not justify processing at time T0 but which willjustify processing at a later time T1. Thus, the block 12 a can bestockpiled for processing at the later time T1. Block 12 b which ismined at T2 has a grade which justifies processing at the time T2, andtherefore may be sent immediately to processing. Block 12 c has a gradewhich is below the cut-off grade and at no future time has a grade whichequals the cut-off grade and therefore, is sent to waste. The preferredembodiment of the invention targets all phases of mine optimisation,including the net present value optimal block extraction sequence,pushback design, and simultaneous cut-off grade and mining scheduleoptimisation.

One embodiment of the invention is shown in FIG. 3. With reference tothis figure, the data acquired from the bore holes 11 is used to createa deterministic block model 201 to thereby provide the blocks 12 havingassigned grade values. The deterministic block model 201 is created byspatial interpolation of drillhole data, preferably using a Krigingprocedure.

The number of blocks in the block model 301 may be reduced byaggregation of the blocks at step 302. The aggregation of the blocks isdisclosed in our International Patent Application Nos. PCT/AU2003/001298and PCT/AU2003/001299. The contents of these two Internationalapplications are incorporated into this specification by this reference.

However the invention is applicable to any sort of aggregation that isspatially connected and respects geometrical block extraction precedenceconstraints.

At step 303, a block removal schedule is created based on a variablecut-off grade to maximise net present value of the mine 10.

The use of a variable cut-off grade introduces a significantdisadvantage in that optimisation of the schedule to obtain maximisednet present value using variable cut-off grade in its direct formulationleads to a non-linear problem. This is much harder to solve than alinear problem or linear value which occurs if a fixed variable cut-offgrade is used in the formulation. To overcome this disadvantage, thepreferred embodiment of the invention provides a linearisation of theproblem, making it possible to use a mixed integer programmingformulation for a simultaneous optimisation of the extraction sequenceand cut-off grade.

FIG. 4 is a graph representing the non-linear cut-off grade 15 which isa plot of total tonnes in a block with a grade greater than gradeplotted against grade. In order to linearise the problem, the function15 is divided into a number of linear steps represented at 17, eachproviding a discrete grade value such as G1, as shown in FIG. 4. Thegrade value G1 is selected using a mixed integer programming formulationfor the simultaneous optimisation of the extraction sequence and thecut-off grade.

Thus, this enables a schedule of block removal to be determined using avariable cut-off grade which maximises the net present value of themine. Thus, return from the mining operation is optimised at anyparticular time.

FIG. 5 is a block diagram showing a still further embodiment of theinvention, and the most preferred embodiment of the invention. In FIG. 5the data previously described is used to create multiple block modelsbecause the drillhole data is typically too sparse to support a uniqueand deterministic block model in accordance with the embodiment of FIG.3. Thus, the likelihood of the block model produced with reference toFIG. 3 matching actual reality is uncertain and questionable. Thus, abetter approach is to use multiple block models which are created byconditional simulation techniques. The conditional simulation techniquesallow the generation of a number of equally probably block models, allof which honour the drillhole data obtained from the drillholes 11 andfirst and second order statistics of the ore body represented,respectively, by probably distribution and variogram (e.g. Isaaks andSrivastava, 1989).

Once again, the number of blocks in each of the models 501 may bereduced by aggregation 502 in the manner referred to in theaforementioned International applications. The block aggregation formedaccording to the algorithm set forth in the aforesaid Internationalapplication, preserves the required slope constraints and is veryflexible allowing the user to fully control the size and shape of theaggregation. The optimisation according to the embodiments of theinvention can be applied to any aggregation of blocks with a set ofprecedence arcs, prescribing which blocks should be extracted before aparticular given block.

At step 303, a schedule 503 of block removal is created dependent upon acut-off grade value to maximise the net present value of the mine. Thecut-off grade value which is used may be a fixed cut-off grade value 503a shown in FIG. 5 or, in the most preferred embodiment of the invention,a variable cut-off grade value 503 b which is the same as the variablecut-off grade value described with reference to FIG. 3.

The simplest and most straight forward use of the multiple block models501 is to estimate the variability in the projected net present valueassociated with the ore body uncertainty by valuing the optimal scheduleobtained from the Kriged model through each of the conditionallysimulated realisations. This is shown in FIG. 6A in which, for example,ten conditional simulations are generated and those ten conditionalsimulations are immediately averaged at step 601.

FIGS. 3 and 5 schematically show an apparatus in the form of a processorwhich may be a personal computer or the like for performing the methodof the preferred embodiment.

FIGS. 6A and 6B are an actual example of valuations of a known pit.

FIG. 6A shows the preferred embodiment of the invention and is aschedule determination which gives the best estimate of the net presentvalue of a mine. In FIG. 6A it is noted that the optimization uses allten simulations of the conditional simulation represented in FIG. 6A.

FIG. 6B shows optimization using only an average grade rather than allten simulations, and shows that an increased net present value is stillobtained if the average of the ten valuations of the conditionalsimulations are used later rather than earlier in the process.

In FIG. 6B the term E-type represents the average of the conditionalsimulations, equivalent to the Kriged model. Here, we explain thedifference between the $671M and $739M valuations that use identicalextraction and cut-off grade (COG) schedules. In following thisexplanation, it is important to realise that each conditional simulationis an equally likely representation of the true block grade.

The extra value arises because the conditional simulations can be valuedindividually using the prescribed COG, then their value averaged, ascompared to the case with the “average” E-type model where the averagingis done earlier, at the grade level. A very simple single block modelwith no discounting will be used to illustrate this.

Single Block Model Example

The following data is used—the average value corresponds to the E-typeblock model. This is a single block model with only three conditionalsimulations.

Block mass (tonnes) 10,000 Number of blocks 1 Conditional simulations 3Grade in each conditional simulation (% Cu) [0.04, 0.06,0.11] Averageblock grade (% Cu) [E-type value] 0.07 Tonnes of Cu in each conditionalsimulation [4, 6, 11] Average block tonnes of Cu [E-type value] 7Revenue per tonne of Cu ($) 2,000 Block value as waste ($) (Zero miningcost!) 0

In valuing this block, we will use a marginal COG (ProcessingCost=Revenue), and look at four situations, represented by fourdifferent processing costs. The marginal COG is calculated thus:

(Block Tonnes)*COG*(Revenue/tonne)=(Block Tonnes)*(ProcessingCost/tonne)

COG=(Processing Cost/tonne)/(Revenue/tonne)

1. COG is less than all conditional simulation grades. COG=0.03% Cu,equivalent to a processing cost of 0.60 $/tonne.

2. COG is greater than only one of the conditional simulation grades.

COG=0.05% Cu, equivalent to a processing cost of 1.00 $/tonne.

3. COG is greater than two of the conditional simulation grades.COG=0.08% Cu, equivalent to a processing cost of 1.60 $/tonne.

4. COG is greater than all conditional simulation grades. COG=0.12% Cu,equivalent to a processing cost of 2.40 $/tonne.

The block valuation will be performed for each situation.

Block Conditional Simulation COG Processing Value ($) ConditionalSimulation E-type Conditional Simulation Situation (% Cu) Cost ($) 1 2 3Average Value ($) Value ($) Value Premium ($) 1 0.03 6000 2000 600016000 8000 8000 0 2 0.05 10000 0 2000 12000 4667 4000 667 3 0.08 16000 00 6000 2000 0 2000 4 0.12 24000 0 0 0 0 0 0This example demonstrates that whenever the conditional simulated gradesfor a block are found to be distributed on both sides of the COG, theblock valuation for the average of the conditional simulations will begreater than the valuation of the average grade (Kriged) model.

The following observations may be helpful:

In situation 2, the E-type valuation effectively attributes negativevalue to the first conditional simulation, whereas when the conditionalsimulations are valued separately this instance is attributed exactlyzero value—its value as waste.

In situation 3, the E-type valuation ignores the value of one of theconditional simulations.

The valuation using the conditional simulations is more realisticbecause when a block is mined, blast hole assays can be used todetermine a close estimate of the actual block grade. With thisnear-perfect information about block grade, we can make an accurateassessment of whether to process or waste a block. This is equivalent tovaluing each conditional simulation individually as if each were anactual reality.

Thus, by using the multiple simulations to produce multiple valuationsand then averaging the multiple valuations in order to produce the netpresent value, a higher expected net present value is obtained than ifthe multiple simulations are first averaged and simply that average isthen used to produce a valuation.

As previously mentioned, the preferred embodiment of the invention usesmixed integer programming formulation to include the multipleconditional simulations and variable cut-off grades. This approachallows one to estimate the gap between the obtained solution and theupper theoretical limit. To illustrate this, an example of howoptimisation is generated will be given by reference to a simple case inwhich one rock-type contains one metal type, which can be processedthrough one processing plant, generalisation to the case of multiplerock types, metals and processing streams is cumbersome but straightforward. For simplicity, we consider below only the case of a discreteset of cut-off grades that is possible to generalise the results to thecontinuous cut-off grade case. The following notations are used:

T is the number of scheduling periods;

N is the number of simulations;

P is the total number of panels;

G is the number of all possible cutoff grades;

R_(i) ^(n) is the total rock in the panel i in simulations n.

Q_(ij) ^(n) is the total ore in the panel i, simulation n, when minedwith the COG j;

V_(ij) ^(n) is the value of the panel i, simulation n, when mined andprocessed with the COG j;

R_(t) ⁰ is the maximum mining capacity in period t;

Q_(t) ⁰ is the maximum processing rate in period t;

S_(i) is the set of panels that must be removed before starting thepanel i;

d^(t) is the time discount factor;

x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t;

y_(it) is a binary variable equal to 1 if the extraction of the panel ihas started in periods 1 to t, and equal to 0 otherwise;

δ_(jt) is a binary variable controlling the selection of the COG appliedin period t;

The MIP formulation is:

$\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$

subject to the following constraints:

$\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{{ijt}\;}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i{\mspace{11mu} \;}{and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$

The objective function (1) represents the discounted cash flow.Constraints (2) and (3) enforce the mining and processing limits onaverage. Constraints (4)-(6) enforce the panel extraction precedenceconstraints, and constraints (7) and (8) ensure that the same COG isapplied to all panels extracted in any given time period. This MIPformulation is solved by the commercially available software packageCPLEX version 9.0, by ILOG Inc.

To test the algorithm we have chosen 10 conditional simulations of ablock model containing one type of metal and using one processing plant.Because of confidentiality requirements all the economic parameters wererescaled and do not represent reality. However, all the relativecharacteristics which demonstrate the potential of the new method arenot affected by the rescaling. The ultimate pit for the design waschosen by using the Lersch-Grossmann algorithm (Lersch and Grossmann,1965) and the procedure similar to that used in Whittle Four-X software.The ultimate pit contains 191 million tonnes of rock and 62.9±2.7million tonnes of ore (above the marginal COG=0.6%). The undiscountedvalue in the ultimate pit (if processed with the marginal COG) is $(1,316±99) million. It was divided into 6 mining phases and scheduledover 12 years. The mining rate was set to 30 MT/year and the processingrate to 5 MT/year. The initial capital investment was assumed to be $300million, and the discount rate 10%. The base case optimisation was doneusing the marginal COG and produced the discounted cash flow $(704±31)million, and the NPV was $(404±31) million. The mining schedule and theNPV are shown, respectively, in FIGS. 7 and 8. The second optimisationwas done using the variable COG, but was based on the mean grade blockmodel, i.e. it was similar to the one which can be generated by usingone deterministic model. The schedule was then evaluated against all 10realisations of ore body model and produced the NPV=$(485±40) million,an increase of 20% over the base case. The results are shown in FIGS. 9and 10. The third optimisation was done using the algorithm describedabove, and produced the NPV=$(505±43) million, a further increase of4.1% over the case of mean grade based optimisation. The results areshown in FIGS. 11 and 12. The relative variability of NPV in all caseswas roughly the same, about 8%. Another important result of the variableCOG policy is that the pay-back period (defined here as the time whenthe cummulative NPV becomes equal to zero) is decreased from 5 to 3years.

The increase of 4.1% in NPV may be not seen as a very substantial, butit should be mentioned that the block model considered does not have ahigh variability. The relative variance in the undiscounted value of theultimate pit is only 7.6%. There are many deposits which can havevariability of the order of 20-30%. For these kind of deposits thepotential improvement in the expected NPV may be substantially high.

Thus, according to the preferred embodiment of the invention, anextraction sequence and cut-off grade policy can be determined which,when evaluated through the whole set of conditionally simulated orebodies, will produce the best possible expected net present value. Thedegree of accuracy of this optimised schedule can be estimatedprecisely, in contrast to prior art techniques.

In the claims which follow and in the preceding description of theinvention, except where the context requires otherwise due to expresslanguage or necessary implication, the word “comprise”, or variationssuch as “comprises” or “comprising”, is used in an inclusive sense, ie.to specify the presence of the stated features but not to preclude thepresence or addition of further features in various embodiments of theinvention.

It is to be understood that the prior art publications referred toherein, do not constitute an admission that that the publication forms apart of the common general knowledge in the art, in Australia or in anyother country.

Since modifications within the spirit and scope of the invention mayreadily be effected by persons skilled within the art, it is to beunderstood that this invention is not limited to the particularembodiment described by way of example hereinabove.

1. A method of scheduling the extraction of a resource in a mine mediumcomprising the steps of: obtaining drillhole grade data relating to theresource contained within the medium; creating a plurality of differentblock models of the mine with a processor, each formed of a plurality ofblocks, each block in each model having a resource grade, each of theblock models honouring the drillhole grade data; and generating a singleschedule for extraction of blocks from the mine with the processor basedon a cut-off grade policy to increase expected net present value havingregard to all of the plurality of different block models.
 2. The methodof claim 1 wherein the creation of the plurality of different blockmodels is a conditional simulation technique which provides thegeneration of a plurality of equally probable block model realisations,all of which honour the data and first and second order statistics ofthe resource represented, respectively, by probability distributionfunction and variogram.
 3. The method of claim 1 wherein the number ofblocks in each of the block models is reduced by aggregating blocksprior to the step of scheduling extraction.
 4. The method of claim 1wherein the cut-off grade is a variable cut-off grade.
 5. The method ofclaim 1 wherein the plurality of block models are used to provide anaverage of resource grade and block valuations and the average of theresource grade and block valuations is used to produce the scheduledextraction of blocks and the cut-off grade value to increase expectednet present value.
 6. The method of claim 1 wherein the scheduledextraction of blocks is optimised by considering the average valuationproduced from the conditional simulations.
 7. The method of claim 1wherein all of the conditional simulations are optimized simultaneouslyto produce a single extraction schedule with a variable cut-off gradepolicy, and wherein all the conditional simulations are valued usingthis schedule and the valuations are averaged to produce the expectednet present value.
 8. The method of claim 1 wherein the extractionschedule determines whether resource and medium corresponding to eachblock is sent for processing, sent to waste or stockpiled for laterprocessing.
 9. The method of claim 1 wherein the step of schedulingusing a variable cut-off grade is converted from a non-linearrepresentation to a linear representation, and a mixed integerprogramming formulation is used for simultaneous optimisation of theextraction schedule and the cut-off grade.
 10. The method of claim 1,wherein the schedule is determined by the following: $\begin{matrix}{{Maximise}\left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{i\; j}^{n}x_{i\; j\; t}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein: T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 11. An apparatus for scheduling the extraction of aresource within a medium in a mine from which drillhole grade datarelating to the resource contained within the medium has been obtainedcomprising: a processor for creating a plurality of different blockmodels of the mine, each formed of a plurality of blocks, each block ineach model having a resource grade, each of the block models honouringthe drillhole grade data; and a processor for generating a singleschedule for extraction of blocks based on a cut-off grade policy toincrease expected net present value having regard to all of theplurality of different block models.
 12. The apparatus of claim 11wherein the processor is for creating conditional simulations whichprovides the generation of a plurality of equally probable block modelrealisations, all of which honour the data and first and second orderstatistics of the resource represented, respectively, by probabilitydistribution function and variogram.
 13. The apparatus of claim 11wherein the processor is also for reducing the number of blocks in eachof the block models by aggregating blocks prior to the step ofscheduling extraction.
 14. The apparatus of claim 11 wherein the cut-offgrade is a variable cut-off grade.
 15. The apparatus of claim 11 whereinthe processor is for providing an average of resource grade and blockvaluations from the plurality of models, and the average of the resourcegrade and block valuations is used to produce the scheduled extractionof blocks and the cut-off grade value to increase expected net presentvalue.
 16. The apparatus of claim 11 wherein the processor is forscheduling extraction of blocks optimised by considering the averagevaluation produced from the conditional simulations.
 17. The apparatusof claim 11 wherein all of the conditional simulations are optimizedsimultaneously to produce a single extraction schedule with a variablecut-off grade policy, and wherein all the conditional simulations arevalued using this schedule and the valuations are averaged to producethe expected net present value.
 18. The apparatus of claim 11 whereinthe extraction schedule determines whether resource and mediumcorresponding to each block is sent for processing, sent to waste orstockpiled for later processing.
 19. The apparatus of claim 11 whereinthe processor is for converting from a non-linear representation to alinear representation when a variable cut-off grade is used, and a mixedinteger programming formulation is used for simultaneous optimisation ofthe extraction schedule and the cut-off grade.
 20. The apparatus ofclaim 11, wherein the schedule is determined by the following:$\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 21. A tangible computer readable medium comprising acomputer program for scheduling the extraction of a resource within amedium in a mine comprising: code which when executed by a processorreceives drillhole grade data relating to the resource contained withinthe medium; code which when executed by a processor creates a pluralityof different block models of the mine, each formed of a plurality ofblocks, each block in each model having a resource grade, each of theblock models honouring the drillhole grade data; and code which whenexecuted by a processor generates a schedule for extraction of blocksfrom the mine based on a cut-off grade policy to increase expected netpresent value having regard to all of the plurality of different blockmodels.
 22. The tangible computer readable medium of claim 21 whereinthe code for creation of the plurality of different block models is codefor performing a conditional simulation technique which provides thegeneration of a plurality of equally probable block model realisations,all of which honour the data and first and second order statistics ofthe resource represented, respectively, by probability distributionfunction and variogram.
 23. The tangible computer readable medium ofclaim 21 wherein the program further comprises code for reducing thenumber of blocks in each of the block models by aggregating blocks priorto the step of scheduling extraction.
 24. The tangible computer readablemedium of claim 21 wherein the code for scheduling further comprisescode for optimizing extraction by considering the average valuationproduced from the conditional simulations.
 25. The tangible computerreadable medium of claim 21 wherein the code for scheduling furthercomprises code for using all of the conditional simulations to optimizesimultaneously to produce a single extraction schedule with a variablecut-off grade policy, and wherein all the conditional simulations arevalued using this schedule and the valuations are averaged to producethe expected net present value.
 26. The tangible computer readablemedium of claim 21 wherein the extraction schedule determines whetherresource and medium corresponding to each block is sent for processing,sent to waste or stockpiled for later processing.
 27. The tangiblecomputer readable medium of claim 21 wherein the code for schedulingusing a variable cut-off grade converts from a non-linear representationto a linear representation, and further comprises a mixed integerprogramming formulation is used for simultaneous optimisation of theextraction schedule and the cut-off grade.
 28. The tangible computerreadable medium of claim 21, wherein the schedule is determined by thefollowing: $\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 29. A method of mining a mine comprising a resource withina medium, the method comprising: removing medium and resource from themine using an extraction schedule created by the following steps:obtaining drillhole grade data relating to the resource contained withinthe medium; creating with a processor a plurality of different blockmodels of the mine, each formed of a plurality of blocks, each block ineach model having a resource grade, each of the block models honouringthe drillhole grade data; and scheduling with a processor, extraction ofblocks based on a cut-off grade policy to increase expected net presentvalue having regard to all of the plurality of different block models.30. The method of claim 29 wherein the creation of the plurality ofdifferent block models is a conditional simulation technique whichprovides the generation of a plurality of equally probable block modelrealisations, all of which honour the data and first and second orderstatistics of the resource represented, respectively, by probabilitydistribution function and variogram.
 31. The method of claim 29 whereinthe number of blocks in each of the block models is reduced byaggregating blocks prior to the step of scheduling extraction.
 32. Themethod of claim 29 wherein the plurality of block models are used toprovide an average of resource grade and block valuations and theaverage of the resource grade and block valuations is used to producethe scheduled extraction of blocks and the cut-off grade value toincrease expected net present value.
 33. The method of claim 29 whereinthe scheduled extraction of blocks is optimised by considering theaverage valuation produced from the conditional simulations.
 34. Themethod of claim 29 wherein all of the conditional simulations areoptimized simultaneously to produce a single extraction schedule with avariable cut-off grade policy, and wherein all the conditionalsimulations are valued using this schedule and the valuations areaveraged to produce the expected net present value.
 35. The method ofclaim 29 wherein the extraction schedule determines whether resource andmedium corresponding to each block is sent for processing, sent to wasteor stockpiled for later processing.
 36. The method of claim 29 whereinthe step of scheduling using a variable cut-off grade is converted froma non-linear representation to a linear representation, and a mixedinteger programming formulation is used for simultaneous optimisation ofthe extraction schedule and the cut-off grade.
 37. The method of claim29, wherein the schedule is determined by the following: $\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 38. A method of determining the net present value of a minecomprising a resource within a medium, the method comprising the stepsof: obtaining drillhole grade data relating to the resource containedwithin the medium; creating a plurality of different block models of themine with a processor, each formed of a plurality of blocks, each blockin each model having a resource grade, each of the block modelshonouring the drillhole grade data; and generating a schedule forextraction of blocks from the mine with a processor based on a cut-offgrade policy to provide the net present value having regard to all ofthe plurality of different block models.
 39. The method of claim 38wherein the creation of the plurality of different block models is aconditional simulation technique which provides the generation of aplurality of equally probable block model realisations, all of whichhonour the data and first and second order statistics of the resourcerepresented, respectively, by probability distribution function andvariogram.
 40. The method of claim 38 wherein the number of blocks ineach of the block models is reduced by aggregating blocks prior to thestep of scheduling extraction.
 41. The method of claim 38 wherein thecut-off grade is a variable cut-off grade.
 42. The method of claim 38wherein the plurality of block models are used to provide an average ofresource grade and block valuations and the average of the resourcegrade and block valuations is used to produce the scheduled extractionof blocks and the cut-off grade value to increase expected net presentvalue.
 43. The method of claim 38 wherein the scheduled extraction ofblocks is optimised by considering the average valuation produced fromthe conditional simulations.
 44. The method of claim 38 wherein all ofthe conditional simulations are optimized simultaneously to produce asingle extraction schedule with a variable cut-off grade policy, andwherein all the conditional simulations are valued using this scheduleand the valuations are averaged to produce the expected net presentvalue.
 45. The method of claim 38 wherein the extraction scheduledetermines whether resource and medium corresponding to each block issent for processing, sent to waste or stockpiled for later processing.46. The method of claim 38 wherein the step of scheduling using avariable cut-off grade is converted from a non-linear representation toa linear representation, and a mixed integer programming formulation isused for simultaneous optimisation of the extraction schedule and thecut-off grade.
 47. The method of claim 38, wherein the schedule isdetermined by the following: $\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 48. A method for scheduling the extraction of a resourcecontained within a medium in a mine, comprising the steps of: obtainingdrillhole grade data relating to the resource contained within themedium; creating a block model of the mine with a processor with eachblock in the model having a resource grade; generating a schedule forextraction of blocks from the mine with a processor based on a variablecut-off grade value to increase expected net present value, the variablecut-off grade being represented by a non-linear function; and convertingthe non-linear representation to a linear representation with theprocessor and using a mixed integer programming formulation for asimultaneous optimisation by the processor of an extraction sequenceprovided by the scheduled extraction and cut-off grade policy.
 49. Themethod of claim 48 wherein the non-linear function is converted to aplurality of linear values by producing a plurality of step valuesrelating to the non-linear function, and selecting one of the values toprovide the cut-off grade decision by the mixed integer programmingfunction.
 50. The method of claim 48 wherein the block model is adeterministic model built by spatial interpretation of the data using aKriging procedure.
 51. The method of claim 48 wherein the block model isa conditional simulation producing a plurality of different block modelsproviding a number of equally probably realisations of block modelshonouring the drillhole data and first and second order statistics ofthe resource distributed in the medium represented, respectively, byprobability distribution and variogram.
 52. The method of claim 48wherein the number of blocks in each of the block models is reduced byaggregating blocks prior to the step of scheduling extraction.
 53. Themethod of claim 48 wherein the plurality of block models are used toprovide an average of resource grade valuations and the average of theresource grade valuations is used to produce the scheduled extraction ofblocks and the cut-off grade value to increase expected net presentvalue.
 54. The method of claim 48 wherein the scheduled extraction ofblocks is optimised by considering the average valuation produced fromthe conditional simulations.
 55. The method of claim 48 wherein all ofthe conditional simulations are optimised to produce a plurality ofextraction schedules, each having valuations and the valuations areaveraged to produce the net present value, and the extraction schedulecomprises the extraction schedule which is closest to that giving thenet present value.
 56. The method of claim 48 wherein the extractionschedule determines whether resource and medium corresponding to eachblock is sent for processing, sent to waste or stockpiled for laterprocessing.
 57. The method of claim 48, wherein the schedule isdetermined by the following: $\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 58. An apparatus for scheduling the extraction of aresource contained within a medium in a mine, comprising: a processorfor receiving drillhole grade data relating to the resource containedwithin the medium; a processor for creating a block model with eachblock in the model having a resource grade; a processor for schedulingextraction of blocks from the mine based on a variable cut-off gradevalue to increase expected net present value, the variable cut-off gradebeing represented by a non-linear function; and a processor forconverting the non-linear representation to a linear representation andusing a mixed integer programming formulation for a simultaneousoptimisation of an extraction sequence provided by the scheduledextraction and cut-off grade policy.
 59. The apparatus of claim 58wherein the processor is for converting the non-linear function to aplurality of linear values by producing a plurality of step valuesrelating to the non-linear function, and selecting one of the values toprovide the cut-off grade decision by the mixed integer programmingfunction.
 60. The apparatus of claim 58 wherein the block model is adeterministic model built by spatial interpretation of the data using aKriging procedure.
 61. The apparatus of claim 58 wherein the block modelis a conditional simulation producing a plurality of different blockmodels providing a number of equally probably realisations of blockmodels honouring the drillhole data and first and second orderstatistics of the resource distributed in the medium represented,respectively, by probability distribution and variogram.
 62. Theapparatus of claim 58 wherein the number of blocks in each of the blockmodels is reduced by aggregating blocks prior to the step of schedulingextraction.
 63. The apparatus of claim 58 wherein the processor is foraveraging of resource grade valuations from the block models and theaverage of the resource grade valuations is used to produce thescheduled extraction of blocks and the cut-off grade value to increaseexpected net present value.
 64. The apparatus of claim 58 wherein thescheduled extraction of blocks is optimised by considering the averagevaluation produced from the conditional simulations.
 65. The apparatusof claim 58 wherein the processor is for optimizing all of theconditional simulations to produce a plurality of extraction schedules,each having valuations and the valuations are averaged to produce thenet present value, and the extraction schedule comprises the extractionschedule which is closest to that giving the net present value.
 66. Theapparatus of claim 58 wherein extraction schedule determines whetherresource and medium corresponding to each block is sent for processing,sent to waste or stockpiled for later processing.
 67. The apparatus ofclaim 58, wherein the schedule is determined by the following:$\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.
 68. A tangible computer readable medium comprising acomputer program for scheduling the extraction of a resource containedwithin a medium in a mine, comprising: code which when executed by aprocessor receives drillhole grade data relating to the resourcecontained within the medium; code which when executed by a processorcreates a block model with each block in the model having a resourcegrade; code which when executed by a processor schedules extraction ofblocks based on a variable cut-off grade value to increase expected netpresent value, the variable cut-off grade being represented by anon-linear function; and code which when executed by a processorconverts the non-linear representation to a linear representation andusing a mixed integer programming formulation for a simultaneousoptimisation of an extraction sequence provided by the scheduledextraction and cut-off grade policy.
 69. The tangible computer readablemedium of claim 68 wherein the non-linear function is converted to aplurality of linear values by producing a plurality of step valuesrelating to the non-linear function, and selecting one of the values toprovide the cut-off grade decision by the mixed integer programmingfunction.
 70. The tangible computer readable medium of claim 68 whereinthe block model is a deterministic model built by spatial interpretationof the data using a Kriging procedure.
 71. The tangible computerreadable medium of claim 68 wherein the block model is a conditionalsimulation producing a plurality of different block models providing anumber of equally probably realisations of block models honouring thedrillhole data and first and second order statistics of the resourcedistributed in the medium represented, respectively, by probabilitydistribution and variogram.
 72. The tangible computer readable medium ofclaim 68 wherein the number of blocks in each of the block models isreduced by aggregating blocks prior to the step of schedulingextraction.
 73. The tangible computer readable medium of claim 68wherein the plurality of block models are used to provide an average ofresource grade valuations and the average of the resource gradevaluations is used to produce the scheduled extraction of blocks and thecut-off grade value to increase expected net present value.
 74. Thetangible computer readable medium of claim 68 wherein the scheduledextraction of blocks is optimised by considering the average valuationproduced from the conditional simulations.
 75. The tangible computerreadable medium of claim 68 wherein all of the conditional simulationsare optimised to produce a plurality of extraction schedules, eachhaving valuations and the valuations are averaged to produce the netpresent value, and the extraction schedule comprises the extractionschedule which is closest to that giving the net present value.
 76. Thetangible computer readable medium of claim 68 wherein the extractionschedule determines whether resource and medium corresponding to eachblock is sent for processing, sent to waste or stockpiled for laterprocessing.
 77. The tangible computer readable medium of claim 68,wherein the schedule is determined by the following: $\begin{matrix}{{Maximise}\mspace{14mu} \left( {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}{V_{ij}^{n}x_{ijt}d^{t}}}}}}} \right)} & (1)\end{matrix}$ subject to the following constraints: $\begin{matrix}{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j - 1}^{G}{R_{i}^{n}x_{ijt}}}}}} \leq R_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (2) \\{{{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\sum\limits_{i = 1}^{P}{\sum\limits_{j = 1}^{G}{Q_{ij}^{n}x_{ijt}}}}}} \leq Q_{t}^{0}},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (3) \\{{y_{i,{t - 1}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i\mspace{14mu} {and}\mspace{14mu} t}} & (4) \\{{{\sum\limits_{\tau = 1}^{t}{\sum\limits_{j = 1}^{G}x_{{ij}\; \tau}}} \leq y_{it}},{{for}\mspace{14mu} {all}\mspace{14mu} i}} & (5) \\{{y_{it} \leq {\sum\limits_{j = 1}^{G}{\sum\limits_{t = 1}^{T}x_{{kj}\; \tau}}}},{{for}\mspace{14mu} {all}\mspace{14mu} i},{{t\mspace{14mu} {and}\mspace{14mu} k} \Subset S_{i}}} & (6) \\{{{\sum\limits_{j = 1}^{G}\delta_{jt}} = 1},{{for}\mspace{14mu} {all}\mspace{14mu} t}} & (7) \\{{x_{ijt} \leq \delta_{jt}},{{for}\mspace{14mu} {all}\mspace{14mu} i},j,{{and}\mspace{14mu} t}} & (8)\end{matrix}$ wherein; T is the number of scheduling periods; N is thenumber of simulations; P is the total number of panels; G is the numberof all possible cutoff grades; R_(i) ^(n) is the total rock in the paneli in simulations n. Q_(ij) ^(n) is the total ore in the panel i,simulation n, when mined with the COG j; V_(ij) ^(n) is the value of thepanel i, simulation n, when mined and processed with the COG j; R_(t) ⁰is the maximum mining capacity in period t; Q_(t) ⁰ is the maximumprocessing rate in period t; S_(i) is the set of panels that must beremoved before starting the panel i; d^(t) is the time discount factor;x_(ijt) is the fraction of the panel i is extracted with the COG j inperiod t; y_(it) is a binary variable equal to 1 if the extraction ofthe panel i has started in periods 1 to t, and equal to 0 otherwise;δ_(jt) is a binary variable controlling the selection of the COG appliedin period t.